Inductive construction of stable envelopes

Inductive Construction of Repletion

Inductive Construction of Moving Frames

This paper presents a useful variation on the moving frame construction, which allows us to use a moving frame for a subgroup A of a Lie group G to produce a moving frame for the entire group G. This algorithm is applicable when G factors as a product of two subgroups G = A · B and automatically produces functional relations among invariants of G and its factors.

Stable kernels and fluid body envelopes

Recent advances in robotics leads us to consider, on the one hand, the notion of a kernel, a set of stable algorithms that drive developmental dynamics and, on the other hand, variable body envelopes that change over time. This division reverses the classic notion of a fixed body on which different software can be applied to consider a fixed software that can be applied to different kinds of em...

Inductive construction of self-associated sets of points

In 1889, Castelnuovo [Ca1] showed that if P1, . . . , P2r+2 are 2r + 2 self-associated points in linearly general position in IP , not lying on a rational normal curve of degree r, then the (r − 2)-plane of IP , spanned by any r − 1 of them and denoted by Λ, is an (r− 1)-secant plane to the unique rational normal curve of degree r, say C , through the remaining r + 3 points. Moreover, the inter...

The role of feature construction in inductive rule learning

This paper proposes a unifying framework for inductive rule learning algorithms. We suggest that the problem of constructing an appropriate inductive hypothesis (set of rules) can be broken down in the following subtasks: rule construction, body construction, and feature construction. Each of these subtasks may have its own declarative bias, search strategies, and heuristics. In particular, we ...